Scheduling chain-structured tasks to minimize makespan and mean flow time
نویسندگان
چکیده
منابع مشابه
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special ca...
متن کاملScheduling Tasks to Minimize the Total Computation and Communication Makespan
as the conclusion. A conclusion might elaborate on the importance of the work or suggest applications and
متن کاملScheduling Malleable Tasks on Parallel Processors to Minimize the Makespan
The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of processors is m and it is an upper bound on the number of processors that can be used by all the ...
متن کاملPreemptive scheduling on uniform machines to minimize mean flow time
In this paper we give a polynomial algorithm for problem Q | rj, pj = p, pmtn | ∑ Cj whose complexity status was open yet. The algorithm is based on a reduction of the scheduling problem to a linear program. The crucial condition for implementing the proposed reduction is the known order of job completion times.
متن کاملOptimal Two Stages Specially Structured Flow Shop Scheduling: Minimize the Rental Cost with Independent Setup Time
One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90009-q